A GPGPU PROGRAMMING FRAMEWORK BASED ON A SHARED-MEMORY MODEL
نویسندگان
چکیده
منابع مشابه
A Framework for Portable Shared Memory Programming
Widespread adaptation of shared memory programming for High Performance Computing has been inhibited by a lack of standardization and the resulting portability problems between platforms and APIs. In this paper we present the HAMSTER framework, which helps overcome these problems via cross-platform support and easy retargetability to a wide range of programming models. HAMSTER currently support...
متن کاملmortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولRealising a Concurrent Object-Based Programming Model on Parallel Virtual Shared Memory Architectures∗
In this paper, we investigate the suitability of parallel architectures for the realisation of a novel objectbased computational model [21] encapsulated within programming languages such as [11]. This model incorporates objects, groups, broadcast message-passing and asynchronous execution. As such it provides a high-level, architecture-independent representation for a variety of concurrent syst...
متن کاملDeterministic Consistency: A Programming Model for Shared Memory Parallelism
The difficulty of developing reliable parallel software is generating interest in deterministic environments, where a given program and input can yield only one possible result. Languages or type systems can enforce determinism in new code, and runtime systems can impose synthetic schedules on legacy parallel code. To parallelize existing serial code, however, we would like a programming model ...
متن کاملTECHNICAL REPORT Ribbons: a Partially Shared Memory Programming Model
The need for programs to execute subcomponents in isolation from each other or with lower privileges is prevalent among today’s systems. We introduce ribbons: a shared memory programming model that allows for more implicit sharing of memory than processes but is more restrictive than threads. Ribbons structure the heap into protection domains. Privileges between these protection domains are car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel and Distributed Computing and Networks
سال: 2013
ISSN: 1925-5543
DOI: 10.2316/journal.211.2013.3.211-1053